On incremental computation of transitive closure and greedy alignmentABDEDDAÏM, S.Lecture notes in computer science. 1997, pp 167-179, issn 0302-9743, isbn 3-540-63220-4Conference Paper

Quasi-greedy triangulations approximating the minimum weight triangulationLEVCOPOULOS, C; KRZNARIC, D.Journal of algorithms (Print). 1998, Vol 27, Num 2, pp 303-338, issn 0196-6774Conference Paper

Guarantees for the success frequency of an algorithm for finding dodgson-election winnersHOMAN, Christopher M; HEMASPAANDRA, Lane A.Lecture notes in computer science. 2006, pp 528-539, issn 0302-9743, isbn 3-540-37791-3, 1Vol, 12 p.Conference Paper

A tight analysis of the greedy algorithm for set coverSLAVIK, P.Journal of algorithms (Print). 1997, Vol 25, Num 2, pp 237-254, issn 0196-6774Article

New results on the k-Truck ProblemWEIMIN MA; YINFENG XU; YOU, Jane et al.Lecture notes in computer science. 2002, pp 504-513, issn 0302-9743, isbn 3-540-43996-X, 10 p.Conference Paper

Improved performance of the greedy algorithm for partial coverSLAVIK, P.Information processing letters. 1997, Vol 64, Num 5, pp 251-254, issn 0020-0190Article

Switches under real internet trafficGIACCONE, Paolo; MELLIA, Marco; MUSCARIELLO, Luca et al.Workshop on high performance switching and routing. 2004, pp 259-263, isbn 0-7803-8375-3, 1Vol, 5 p.Conference Paper

The probabilistic analysis of a greedy satisfiability algorithmKAPORIS, Alexis C; KIROUSIS, Lefteris M; LALAS, Efthimios G et al.Lecture notes in computer science. 2002, pp 574-585, issn 0302-9743, isbn 3-540-44180-8, 12 p.Conference Paper

Online bin coloringKRUMKE, Sven O; DE PAEPE, Willem E; RAMBAU, Jörg et al.Lecture notes in computer science. 2001, pp 74-85, issn 0302-9743, isbn 3-540-42493-8Conference Paper

Greedy algorithms for minimisation problems in random regular graphsZITO, Michele.Lecture notes in computer science. 2001, pp 524-536, issn 0302-9743, isbn 3-540-42493-8Conference Paper

Méthodes et algorithmes pour le test intégré de circuits VLSI combinatoires = Methods and algorithms for the combinational circuits Built-In Self TestFagot, Christophe; Gascuez, Olivier.2000, 137 p.Thesis

Learning relational Clichés with Contextual LGGMORIN, Johanne; MATWIN, Stan.Lecture notes in computer science. 2000, pp 274-282, issn 0302-9743, isbn 3-540-41094-5Conference Paper

An improved inductive learning algorithm with a preanalysis of dataKACPRZYK, J; SZKATUŁA, G.Lecture notes in computer science. 1997, pp 157-166, issn 0302-9743, isbn 3-540-63614-5Conference Paper

Bit allocation algorithms for frequency and time spread perceptual codingDER, Ricky; KABAL, Peter; CHAN, Wai-Yip et al.ICASSP. 2004, isbn 0-7803-8484-9, vol IV, 201-204Conference Paper

Approximating the range sum of a graph on CREW PRAMSRIVASTAVA, Saurabh; GUPTA, Phalguni.Lecture notes in computer science. 2002, pp 312-318, issn 0302-9743, isbn 3-540-00355-X, 7 p.Conference Paper

T3: A classification algorithm for data miningTJORTJIS, Christos; KEANE, John.Lecture notes in computer science. 2002, pp 50-55, issn 0302-9743, isbn 3-540-44025-9, 6 p.Conference Paper

An improved learning algorithm for augmented Naive BayesHUAJIE ZHANG; LING, Charles X.Lecture notes in computer science. 2001, pp 581-586, issn 0302-9743, isbn 3-540-41910-1Conference Paper

Explicitly using default knowledge in concept learning : An extended description logics plus strict and default rulesVENTOS, Véronique; BREZELLEC, Pierre; SOLDANO, Henry et al.Lecture notes in computer science. 2001, pp 173-185, issn 0302-9743, isbn 3-540-42593-4Conference Paper

On plan adaptation through planning graph analysisGEREVINI, A; SERINA, I.Lecture notes in computer science. 2000, pp 356-367, issn 0302-9743, isbn 3-540-67350-4Conference Paper

Greedy strikes back : Improved facility location algorithmsGUHA, S; KHULLER, S.Journal of algorithms (Print). 1999, Vol 31, Num 1, pp 228-248, issn 0196-6774Conference Paper

Feature selection for a nonlinear classifierSATO, M; KUDO, M; TOYAMA, J et al.Lecture notes in computer science. 1998, pp 555-563, issn 0302-9743, isbn 3-540-64858-5Conference Paper

On the complexity of wavelength convertersAULETTA, V; CARAGIANNIS, I; KAKLAMANIS, C et al.Lecture notes in computer science. 1998, pp 771-779, issn 0302-9743, isbn 3-540-64827-5Conference Paper

The T-DSATUR algorithm : An interesting generalization of the DSATUR algorithmJANCZEWSKI, R; KUBALE, M.International conference on advanced computer systems. 1998, pp 288-292, isbn 83-87362-11-5Conference Paper

A multi-tree generating routing scheme using acyclic orientationsANNEXSTEIN, F. S; BERMAN, K. A; SWAMINATHAN, R et al.Lecture notes in computer science. 1997, pp 18-22, issn 0302-9743, isbn 3-540-63357-XConference Paper

Orthogonal matching pursuit with DCD iterationsZAKHAROV, Y. V; NASCIMENTO, V.Electronics letters. 2013, Vol 49, Num 4, pp 295-297, issn 0013-5194, 3 p.Article